Kernel Dependency Estimation
نویسندگان
چکیده
We consider the learning problem of finding a dependency between a general class of objects and another, possibly different, general class of objects. The objects can be for example: vectors, images, strings, trees or graphs. Such a task is made possible by employing similarity measures in both input and output spaces using kernel functions, thus embedding the objects into vector spaces. We experimentally validate our approach on several tasks: mapping strings to strings, pattern recognition, and reconstruction from partial images.
منابع مشابه
Learning Structured Outputs via Kernel Dependency Estimation and Stochastic Grammars
We focus on graph-valued outputs in supervised learning and propose a novel solution to the pre-image problem in the kernel dependency estimation framework. Output structures are generated by a stochastic grammar and the output feature space is directly associated with the set of productions for the grammar. The regression estimation step learns to map input examples into a feature vector that ...
متن کاملFourier Series Based Bandwidth Selectors for Kernel Density Estimation
A class of Fourier series based plug-in bandwidth selectors for kernel density estimation is considered in this paper. The proposed data-dependent bandwidths are simple to obtain, easy to interpret and consistent for a wide class of compact supported distributions. Some of them present good finite sample comparative performances against the classical two-stage direct plug-in method or the least...
متن کاملNonparametric Latent Tree Graphical Models: Inference, Estimation, and Structure Learning
Tree structured graphical models are powerful at expressing long range or hierarchical dependency among many variables, and have been widely applied in different areas of computer science and statistics. However, existing methods for parameter estimation, inference, and structure learning mainly rely on the Gaussian or discrete assumptions, which are restrictive under many applications. In this...
متن کاملError estimation for nonlinear pseudoparabolic equations with nonlocal boundary conditions in reproducing kernel space
In this paper we discuss about nonlinear pseudoparabolic equations with nonlocal boundary conditions and their results. An effective error estimation for this method altough has not yet been discussed. The aim of this paper is to fill this gap.
متن کاملFinite sample penalization in adaptive density deconvolution
We consider the problem of estimating the density g of identically distributed variables Xi, from a sample Z1, . . . , Zn where Zi = Xi + σεi, i = 1, . . . , n and σεi is a noise independent of Xi with known density σ fε(./σ). We generalize adaptive estimators, constructed by a model selection procedure, described in Comte et al. (2005). We study numerically their properties in various contexts...
متن کاملTHE COMPARISON OF TWO METHOD NONPARAMETRIC APPROACH ON SMALL AREA ESTIMATION (CASE: APPROACH WITH KERNEL METHODS AND LOCAL POLYNOMIAL REGRESSION)
Small Area estimation is a technique used to estimate parameters of subpopulations with small sample sizes. Small area estimation is needed in obtaining information on a small area, such as sub-district or village. Generally, in some cases, small area estimation uses parametric modeling. But in fact, a lot of models have no linear relationship between the small area average and the covariat...
متن کامل